#include "main.h"

/*
 * 1. divide n elements into n/5 groups of 5 elements each, and find the median of each group
 * 2. recursively select the median x of the n/5 group medians
 * 3. partition with x as pivot
 *    Let k = rank(x)
 * 4. if i = k then return k
 *    if i < k then recursively select the ith smallest element in the lower part of array
 *    else     then recursively select the (i-k)th smallest element in the upper part of array
 */
 
 
int thetaN_select(int* array, int beg, int end, int k)
{
	return 0;
}